Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
نویسندگان
چکیده
منابع مشابه
Bicriteria Scheduling of Equal Length Jobs with Release Dates on Identical Parallel Machines
We consider bicriteria scheduling problems on parallel, identical machines with job release dates. The jobs are assumed to have equal processing times. Our main goal in this paper is to report complexity results for bicriteria problems in this environment when the number of machines is assumed to be a fixed or constant value. The results are based on a straightforward use of the dynamic program...
متن کاملThe polynomial solvability of selected bicriteria scheduling problems on parallel machines with equal length jobs and release dates
We consider bicriteria scheduling problems involving several classical well-known scheduling objectives on parallel, identical machines with job release dates. The jobs are assumed to have equal processing times. Our bicriteria treatment of these problems includes lexicographic optimization, minimization of a composite linear function, generation of schedules on the efficient frontier and the g...
متن کاملOnline Scheduling of Equal-Length Jobs on Parallel Machines
We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio decreasing to e/(e − 1) ≈ 1.58 as the number of machine increases. For m ≥ 3, this is the first algorithm better than 2-competitive greedy algo-
متن کاملEfficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
We consider the problem of scheduling jobs with equal lengths on uniform parallel batch machines with nonidentical capacities where each job can only be processed on a specified subset of machines called its processing set. For the case of equal release times, we give efficient exact algorithms for various objective functions. For the case of unequal release times, we give efficient exact algor...
متن کاملScheduling equal-length jobs on identical parallel machines
We study the situation where a set of n jobs with release dates and equal processing times have to be scheduled on m identical parallel machines. We show that, if the objective function can be expressed as the sum of n functions fi of the completion time Ci of each job Ji, the problem can be solved in polynomial time for any fixed value of m. The only restriction is that functions fi have to be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2009
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2009.05.005